Cyclic Polygonal Designs with Block Size 3 and λ = 1 for Joint Distance α = 6 to 16

نویسندگان

  • M. H. Tahir
  • Ijaz Iqbal
  • Munir Akhtar
  • Javid Shabbir
چکیده

Stufken (1993) first introduced cyclic polygonal designs (CPDs) (in terms of cyclic balanced sampling plans excluding adjacent units (CBSAs)) for joint distance α ≥ 2. Wei (2002) first suggested the use of Langford sequence for the existence and construction of CPDs with block size k = 3 and λ = 1 for arbitrary α . Zhang and Chang (2005b) used Langford and extended Langford sequence, and constructed CPDs (in terms of CBSAs) with block size k = 3 and λ = 1 for joint distance α = 2,3. Zhang and Chang (2006) also constructed CPDs by using Langford sequence with k = 3 and λ = 1 for joint distance α = 4. Mandal, Parsad and Gupta (2008a) used symmetrically repeated differences and linear programming approach and gave a catalog of CPDs with k= 3, and λ = 1 for joint distance α = 2,3,4 and for some v. In this paper, we use the method of cyclic shifts and constructed CPDs with k = 3 and λ = 1 for joint distance α = 6 to 16. A catalog of non-fractional and fractional (or smaller ) CPDs for v≤ 100 treatments is compiled. AMS Subject Classification: 05B05; 62K10; 62D05. Key-words: BIBD; Cyclic BSA; Cyclic block design; Cyclic polygonal design; Cyclic shifts; Distance between the units; PBIBD.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cyclic Polygonal Designs with Block size 3 and Joint Distance 3

Polygonal designs, a class of partially balanced incomplete block designs with regular polygons, are useful in survey sampling in terms of balanced sampling plans excluding contiguous units (BSECs) and balanced sampling plans excluding adjacent units (BSAs) when neighboring units in a population provide similar information. In this paper, the method of cyclic shifts is used and cyclic polygonal...

متن کامل

Some existence and construction results of polygonal designs

This paper revisits the existence and construction problems for polygonal designs (a special class of partially balanced incomplete block designs associated with regular polygons). We present new polygonal designs with various parameter sets by explicit construction. In doing so we employ several construction methods – some conventional and some new. We also establish a link between a class of ...

متن کامل

Balanced incomplete block designs with block size~9: Part III

The necessary conditions for the existence of a balanced incomplete block design on v points, with index λ and block size k, are that: λ(v − 1) ≡ 0 mod (k − 1) λv(v − 1) ≡ 0 mod k(k − 1) Earlier work has studied k = 9 with λ ∈ {1, 2, 3, 4, 6, 8, 9, 12}. In this article we show that the necessary conditions are sufficient for λ = 9 and every other λ not previously studied.

متن کامل

Splitting group divisible designs with block size 2×4

The necessary conditions for the existence of a (2 × 4, λ)-splitting GDD of type g are gv ≥ 8, λg(v−1) ≡ 0 (mod 4), λg2v(v−1) ≡ 0 (mod 32). It is proved in this paper that these conditions are also sufficient except for λ ≡ 0 (mod 16) and (g, v) = (3, 3).

متن کامل

Use of Resolvable Designs in Field and on Farm Experiments

1. Introduction Resolvable designs, though introduced in the combinatorial context, have found their utility in field experiments. The concept of resolvability is due to Bose (1942) who defined this for a balanced incomplete block (BIB) design. A BIB design is an arrangement of v treatments into b blocks such that each block contains k (< v) distinct treatments, each treatment appears in r bloc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010